Finding of the smallest enclosing cube to improve molecular modeling
نویسنده
چکیده
It is argued that by optimizing the orientation of a molecule in a cube can improve the efficiency of certain molecular modeling procedures.
منابع مشابه
Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملParallel Enclosing Rectangle on Simd Machines 1
In this paper, we present a parallel algorithm for nding the smallest enclosing rectangle for a set of n points. The parallel algorithm can be generally implemented on mesh{connected and cube{connected SIMD computers with the time complexity O(p n) and O(log 2 n) respectively .
متن کاملOn the Smallest Enclosing Balls
In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R . Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the k-circumscribing enclosing ball with smallest k is the smallest enclosing ball, which dramatically reduces a possible large number of computati...
متن کاملFitting enclosing cylinders to data in R
A simple iterative algorithm is given for finding a stationary point of the (non-convex) problem of finding the smallest enclosing (n− d)cylinder to discrete data in Rn, that is a cylinder whose axis is a ddimensional linear manifold. An important special case is the problem of finding the smallest enclosing (usual) cylinder, when n = 3 and d = 1. The method is based on the solution of a sequen...
متن کاملSmallest Enclosing Ball for a Point Set with Strictly Convex Level Sets
Let the center point be the point that minimizes the maximum distance from a point of a given point set to the center point. Finding this center point is referred to as the smallest enclosing ball problem. In case of points with Euclidean distance functions, the smallest enclosing ball is actually the center of a geometrical ball. We consider point sets with points that have distance functions ...
متن کامل